Labeling on Line Digraphs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Mod Difference Labeling of Digraphs

A digraph D = (V,E) is a mod difference digraph if there exist a positive integer m and a labeling L : V → {1, 2, . . . , m − 1} such that (x, y) ∈ E if and only if L(y) − L(x) ≡ L(w)(mod m) for some w ∈ V. In this paper we prove that complete symmetric digraphs, unipaths and unicycles are mod difference digraphs.

متن کامل

On Z3-Magic Labeling and Cayley Digraphs

Let A be an abelian group. An A-magic of a graph G = (V, E) is a labeling f : E(G) → A\{0} such that the sum of the labels of the edges incident with u ∈ V is a constant, where 0 is the identity element of the group A. In this paper we prove Z3-magic labeling for the class of even cycles, Bistar, ladder, biregular graphs and for a certain class of Cayley digraphs. Mathematics Subject Classifica...

متن کامل

Block Line Cut Vertex Digraphs of Digraphs

In this paper, the digraph valued function(digraph operator), namely the block line cut vertex digraph BLC(D) of a digraph D is defined, and the problem of reconstructing a digraph from its block line cut vertex digraph is presented. Outer planarity, maximal outer planarity, and minimally non-outer planarity properties of these digraphs are discussed.

متن کامل

From expanded digraphs to lifts of voltage digraphs and line digraphs∗

In this note we present a general approach to construct large digraphs from small ones. These are called expanded digraphs, and, as particular cases, we show the close relationship between lifted digraphs of voltage digraphs and line digraphs, which are two known ways to obtain dense digraphs. In the same context, we show the equivalence between the vertex-splitting and partial line digraph tec...

متن کامل

Labeling Points on a Single Line

In this paper, we consider a map labeling problem where the points to be labeled are restricted on a line. It is known that the 1d-4P and the 1d-4S unit-square label placement problem and the Slope-4P unit-square label placement problem can both be solved in linear time and the Slope-4S unit-square label placement problem can be solved in quadratic time in [7]. We extend the result to the follo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Indian Journal of Science and Technology

سال: 2016

ISSN: 0974-5645,0974-6846

DOI: 10.17485/ijst/2016/v9i44/85165